Handling imprecise and missing evaluations in multi-criteria majority-rule sorting

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Handling imprecise evaluations in multiple criteria decision aiding and robust ordinal regression by n-point intervals

We consider imprecise evaluation of alternatives in multiple criteria ranking problems. The imprecise evaluations are represented by n-point intervals which are defined by the largest interval of possible evaluations and by its subintervals sequentially nested one in another. This sequence of subintervals is associated with an increasing sequence of plausibility, such that the plausibility of a...

متن کامل

A Model for Decision Making with Missing, Imprecise, and Uncertain Evaluations of Multiple Criteria

In real-life multicriteria decision making (MCDM) problems, the evaluations against some criteria are often missing, inaccurate, and even uncertain, but the existing theories and models cannot handle such evaluations well. To address the issue, this paper extends the Dempster–Shafer (DS)/analytic hierarchy process (DS/AHP) approach of MCDM to handle three types of ambiguous evaluations: missing...

متن کامل

Interjurisdictional Sorting and Majority Rule: An Empirical Analysis

The goal of this paper is to provide a comprehensive empirical analysis of majority rule and Tiebout sorting within a system of local jurisdictions. The idea behind the estimation procedure is to investigate whether observed levels of public expenditures satisfy necessary conditions implied by majority rule in a general equilibrium model of residential choice. The estimator controls for observe...

متن کامل

Missing Data Handling in Multi-Layer Perceptron

Multi layer perceptron with back propagation algorithm is popular and more used than other neural network types in various fields of investigation as a non-linear predictor. Though MLP can solve complex and non-linear problems, it cannot use missing data for training directly. We propose a training algorithm with incomplete pattern data using conventional MLP network. Focusing on the fact that ...

متن کامل

Majority Consensus and the Local Majority Rule

we only show one further result that emphasizes our point that understanding LMP is fundamental to understanding any generalization of this process. A simple generalization of the local majority process would allow vertex v to have some resistivity towards color switch. Formally, for a nonnegative integer kv, we de ne a kv-local majority rule for vertex v: ct+1 v = ( ctv if jfw 2 Nv : ctw = ctv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2019

ISSN: 0305-0548

DOI: 10.1016/j.cor.2019.05.027